Lp and BMO Bounds of Weighted Hardy–Littlewood Averages

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds for the weighted Lp discrepancy and tractability of integration

Quite recently Sloan and Woźniakowski [4] introduced a new notion of discrepancy, the so called weighted L discrepancy of points in the d-dimensional unit cube for a sequence γ = (γ1, γ2, . . .) of weights. In this paper we prove a nice formula for the weighted L discrepancy for even p. We use this formula to derive an upper bound for the average weighted L discrepancy. This bound enables us to...

متن کامل

-Weighted Inequalities with Lipschitz and BMO Norms

Copyright q 2010 Yuxia Tong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We first define a new kind of A λ3 r λ 1 , λ 2 , ΩΩ two-weight, then obtain some two-weight integral inequalities with Lipschitz norm and BMO norm ...

متن کامل

LP REGULARITY OF AVERAGES OVER CURVES AND BOUNDS FOR ASSOCIATED MAXIMAL OPERATORS By MALABIKA PRAMANIK and ANDREAS SEEGER

We prove that for a finite type curve in R3 the maximal operator generated by dilations is bounded on Lp for sufficiently large p. We also show the endpoint Lp → L 1/p regularity result for the averaging operators for large p. The proofs make use of a deep result of Thomas Wolff about decompositions of cone multipliers.

متن کامل

Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds

There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We present quite simple polynomial-time approximation algorithms that are based on linear programmin...

متن کامل

Weighted Averages and Double Exponential Algorithms

This paper reviews two simple numerical algorithms particularly useful in Computational ElectroMagnetics (CEM): the Weighted Averages (WA) algorithm and the Double Exponential (DE) quadrature. After a short historical introduction and an elementary description of the mathematical procedures underlying both techniques, they are applied to the evaluation of Sommerfeld integrals, where WA and DE c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2001

ISSN: 0022-247X

DOI: 10.1006/jmaa.2001.7594